Characterization of inclusion neighbourhood in terms of the essential graph
نویسنده
چکیده
The question of efficient characterization of inclusion neighbourhood is crucial in some methods for learning (equivalence classes of) Bayesian networks. In this paper, neighbouring equivalence classes of a given equivalence class of Bayesian networks are characterized efficiently in terms of the respective essential graph. One can distinguish two kinds of inclusion neighbours: upper and lower ones. This paper reveals the hidded internal structure of both parts of the inclusion neighbourhood. It is shown here that each inclusion neighbour is uniquely described by a pair ([a,b],C) where [a,b] is an unordered pair of distinct nodes and C Nn{a,b} is a disjoint set of nodes in the essential graph. Upper neighbours correspond to edges in the essential graph, while lower neighbours correspond to pairs of nodes that are not edges in the essential graph. Given a pair [a,b] of distinct nodes in the essential graph, the class of those sets C that ([a,b],C) encodes an inclusion neighbour is characterized. The class has a special form; it is uniquely determined by certain distinguished sets. These distinguished sets of the class can be read directly from the essential graph. 2004 Elsevier Inc. All rights reserved.
منابع مشابه
2 Characterization of inclusion neighbourhood 3 in terms of the essential graph q 4
10 The question of efficient characterization of inclusion neighbourhood is crucial in some 11 methods for learning (equivalence classes of) Bayesian networks. In this paper, neighbouring 12 equivalence classes of a given equivalence class of Bayesian networks are characterized effi13 ciently in terms of the respective essential graph. One can distinguish two kinds of inclusion 14 neighbours: u...
متن کاملCharacterization of Inclusion Neighbourhood in Terms of the Essential Graph: Uper Neighbours
The topic of the contribution is to characterize the inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph in such a way that it can be used eeciently in a method of local search for maximization of a quality criterion. One can distinguish two kinds of inclusion neighbours: upper and lower ones. A previous paper 15] gave a character...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملCharacterization of Inclusion Neighbourhood in Terms of the Essential Graph: Upper Neighbours ? 1 Motivation 1.1 Learning Bayesian Networks
The problem of eecient characterization of inclusion neighbourhood is crucial for some methods of learning (equivalence classes of) Bayesian networks. In this paper, neighbouring equivalence classes of a given equivalence class of Bayesian networks are characterized eeciently by means of the respective essential graph. The characterization reveals hidded internal structure of the inclusion neig...
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 38 شماره
صفحات -
تاریخ انتشار 2005